Papers with neural graph-based parsing
Recurrent models and lower bounds for projective syntactic decoding (N19-1)
Copied to clipboard
| Challenge: | a string of recent work has attempted to delve into the formal properties of neural network topology choices. |
| Approach: | They propose to use recurrent models to perform projective maximum spanning tree decoding . they also prove the lower bounds of projective maximal spanning trees . |
| Outcome: | The proposed model can perform better than Eisner's model, proving it impossible to predict a projective MST. |